Multiple-Valued Logic Minimization using Universal Literals and Cost Tables
نویسندگان
چکیده
We propose a minimization algorithm that combines cost tables and simulated annealing. Unlike other minimization procedures that use cost tables, our method does not rely on the enumeration of all minterms, it works directly with the expression (a sum of product terms). We tested our method with a cost table obtained from current mode CMOS. The algorithm can be readily adapted to any other technology by simply replacing the cost table. The technology dependency is limited to the cost table. Results from our implementation are very encouraging.
منابع مشابه
Multiple-Valued Logic Operations with Universal Literals
We propose the use of universal literals as a means of reducing the cost of multiple-valued circuits. A universal literal is any function on one variable. The target architecture is a sum-of-products structure, where sum is the truncated sum and product terms consist of the minimum of universal literals. A significant cost reduction is demonstrated over the conventional window literal. The prop...
متن کاملMultiple-valued Logic Operations with Universal Literalst
We propose the use of universal literals as a means of reducing the cost of multiple-valued circuits. A universal literal is any function on one variable. The target architecture is a sum-of-products structure, where sum is the truncated sum and product terms consist of the minimum of universal literals. A significant cost reduction is demonstrated over the conventional window literal. The prop...
متن کاملMinimization of Exclusive Sums of Multi-Valued Complex Terms for Logic Cell Arrays
| The paper proposes a new layout-driven multi-level logic factorization methodology for regular arrays of two-input cells, that can nd practical applications in ne-grain FPGA design, standard cell, gate matrix layout and sub-micron technologies. A new factorization algorithm for AND/OR/EXOR logic with multi-valued literals is introduced, that has application to minimization of Logic Cell Array...
متن کاملMultiple-Valued Programmable Logic Arrays with Universal Literals
A universal literal is a single-variable function and has an ability to manipulate more information than a set lateral. The array size therefore could be eliminated b y using universal literal generators (ULGs for short) in programmable logic arrays (PLAs), compared to PLAs with set literals. This paper discusses what operator is the most suitable in the term of eliminating the array size. We f...
متن کاملPrime and Non-prime Implicants in the Minimization of Multiple-valued Logic Functions
We investigate minimal sum-of-products expressions for multiple-valued logic functions for realization by programmable logic arrays. Our focus is on expressions where product terms consist of the MIN of interval literals on input variables and are combined using one of two operations SUM or MAX. In binary logic, the question of whether or not prime implicants are sufficient to optimally realize...
متن کامل